Convexified modularity maximization for degree-corrected stochastic block models
نویسندگان
چکیده
منابع مشابه
Convexified Modularity Maximization for Degree-corrected Stochastic Block Models
The stochastic block model (SBM) is a popular framework for studying community detection in networks. This model is limited by the assumption that all nodes in the same community are statistically equivalent and have equal expected degrees. The degree-corrected stochastic block model (DCSBM) is a natural extension of SBM that allows for degree heterogeneity within communities. This paper propos...
متن کاملRelating modularity maximization and stochastic block models in multilayer networks
Characterizing large-scale organization in networks, including multilayer networks, is one of the most prominent topics in network science and is important for many applications. One type of mesoscale feature is community structure, in which sets of nodes are densely connected internally but sparsely connected to other dense sets of nodes. Two of the most popular approaches for community detect...
متن کاملBayesian Degree-Corrected Stochastic Block Models for Community Detection
Community detection in networks has drawn much attention in diverse fields, especially social sciences. Given its significance, there has been a large body of literature among which many are not statistically based. In this paper, we propose a novel stochastic blockmodel based on a logistic regression setup with node correction terms to better address this problem. We follow a Bayesian approach...
متن کاملNon-Backtracking Spectrum of Degree-Corrected Stochastic Block Models
Motivated by community detection, we characterise the spectrum of the non-backtracking matrix B in the Degree-Corrected Stochastic Block Model. Specifically, we consider a random graph on n vertices partitioned into two equalsized clusters. The vertices have i.i.d. weights {φu}u=1 with second moment Φ. The intra-cluster connection probability for vertices u and v is φuφv n a and the inter-clust...
متن کاملModel Selection for Degree-corrected Block Models
The proliferation of models for networks raises challenging problems of model selection: the data are sparse and globally dependent, and models are typically high-dimensional and have large numbers of latent variables. Together, these issues mean that the usual model-selection criteria do not work properly for networks. We illustrate these challenges, and show one way to resolve them, by consid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2018
ISSN: 0090-5364
DOI: 10.1214/17-aos1595